Linear Codes Through Latin Squares Modulo n
نویسندگان
چکیده
It is known that t mutually orthogonal latin squares of order n generate a b t 2c-error correcting code with n codewords. In this paper we consider latin squares of order n made up of elements taken from Zn. In this situation we consider when this code is linear. We present neccessary and sufficient conditions on the latin squares and obtain a method of constructing a maximal family of mutually orthogonal latin squares that form linear codes. In particular, we have shown that no pair of mutually orthogonal latin squares of even order generate a linear code.
منابع مشابه
Permutation Polynomials Modulo w
We give an exact characterization of permutation polynomials mod ulo n w w a polynomial P x a a x adx d with integral coe cients is a permutation polynomial modulo n if and only if a is odd a a a is even and a a a is even We also characterize polynomials de ning latin squares mod ulo n w but prove that polynomial multipermutations that is a pair of polynomials de ning a pair of orthogonal latin...
متن کاملA Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube
Let B,, denote the set of n-bit binary strings, and let Q, denote the graph of the n-cube where V(Q,> = B, and where two vertices are adjacent iff their Humming distance is exactly one. A subset C of B, is called a code, and the elements of C are referred to as codewords. C is said to be a linear code if the codeword obtained from component-wise sum (modulo 2) of any two elements of C is again ...
متن کاملLatin Squares with No Transversals
A k-plex in a latin square of order n is a selection of kn entries that includes k representatives from each row and column and k occurrences of each symbol. A 1-plex is also known as a transversal. It is well known that if n is even then Bn, the addition table for the integers modulo n, possesses no transversals. We show that there are a great many latin squares that are similar to Bn and have...
متن کاملCompleting Partial Latin Squares with Two Prescribed Diagonals
In the present paper we will prove that every partial latin square L = (lij) of odd order n with 2 cyclically generated diagonals (li+t,j+t = lij+t if lij is not empty; with calculations modulo n) can be cyclically completed.
متن کاملCompleting partial latin squares with prescribed diagonals
This paper deals with completion of partial latin squares L = (lij) of order n with k cyclically generated diagonals (li+t,j+t = lij + t if lij is not empty; with calculations modulo n). There is special emphasis on cyclic completion. Here, we present results for k = 2, . . . , 7 and odd n ≤ 21, and we describe the computational method used (hill-climbing). Noncyclic completion is investigated ...
متن کامل